Stronger Typings for Separate Compilation of Java-like Languages.
نویسندگان
چکیده
منابع مشابه
Stronger Typings for Separate Compilation of Java - like Languages ( Extended
We define a formal system supporting separate compilation for a small but significant Java-like language. This system is proved to be stronger than the standard compilation of both Java and C#, in the sense that it better supports software reuse by avoiding unnecessary recompilation steps after code modification which are usually performed by using the standard compilers. This is achieved by in...
متن کاملStronger Typings for Separate Compilation of Java-like Languages
We formally define and implement a formal system supporting separate compilation for a small but significant Java-like language. This system is formally proved to be stronger than the standard compilation of both Java and C#, in the sense that it better supports software reuse by avoiding unnecessary recompilation steps after code modification which are usually performed by using the standard c...
متن کاملStronger Typings for Smarter Recompilation of Java-like Languages
We define an algorithm for smarter recompilation of a small but significant Java-like language; such an algorithm is inspired by a type system previously defined by Ancona and Zucca. In comparison with all previous type systems for Java-like languages, this system enjoys the principal typings property, and is based on the two novel notions of local type assumption and entailment of type environ...
متن کاملEven More Principal Typings for Java-like Languages
We propose a new type system for Java-like languages which allows compilation of a class in isolation, that is, in a context where no information is available on other classes. Indeed, by this type system it is possible to infer the assumptions guaranteeing type correctness of a class c, and generate (abstract) bytecode for c, by just inspecting the source code of c. Then, a collection of class...
متن کاملCompositional Compilation for Java-like Languages through Polymorphic Bytecode
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assumptions are satisfied, without reinspecting the code. Even though compositional compilation is a highly desirable feature, in Java-like languages it can hardly be achieved. This is due to the fact that the bytecode gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2004
ISSN: 1660-1769
DOI: 10.5381/jot.2004.3.6.a1